k-Restricted rotation distance between binary treesLUCCIO, Fabrizio; ENRIQUEZ, Antonio Mesa; PAGLI, Linda et al.Information processing letters. 2007, Vol 102, Num 5, pp 175-180, issn 0020-0190, 6 p.Article

Rotation distance is fixed-parameter tractableCLEARY, Sean; JOHN, Katherine St.Information processing letters. 2009, Vol 109, Num 16, pp 918-922, issn 0020-0190, 5 p.Article

An improved kernel size for rotation distance in binary treesLUCAS, Joan M.Information processing letters. 2010, Vol 110, Num 12-13, pp 481-484, issn 0020-0190, 4 p.Article

Restricted rotation distance between binary treesCLEARY, Sean.Information processing letters. 2002, Vol 84, Num 6, pp 333-338, issn 0020-0190, 6 p.Article

Lower bounds on the rotation distance of binary treesLUCCIO, Fabrizio; MESA ENRIQUEZ, Antonio; PAGLI, Linda et al.Information processing letters. 2010, Vol 110, Num 21, pp 934-938, issn 0020-0190, 5 p.Article

Refined upper bounds for right-arm rotation distancesCLEARY, Sean; LUCCIO, Fabrizio; PAGLI, Linda et al.Theoretical computer science. 2007, Vol 377, Num 1-3, pp 277-281, issn 0304-3975, 5 p.Article

The Fermat star of binary treesLUCCIO, Fabrizio; PAGLI, Linda.Information processing letters. 2009, Vol 109, Num 11, pp 568-571, issn 0020-0190, 4 p.Article

Right-arm rotation distance between binary treesPALLO, Jean Marcel.Information processing letters. 2003, Vol 87, Num 4, pp 173-177, issn 0020-0190, 5 p.Article

Bounding restricted rotation distanceCLEARY, Sean; TABACK, Jennifer.Information processing letters. 2003, Vol 88, Num 5, pp 251-256, issn 0020-0190, 6 p.Article